Equilibrium Bidding Strategy for Gsp Keyword Auctions

نویسندگان

  • Linjing Li
  • Daniel Zeng
  • Feiyue Wang
چکیده

The generalized second-pri ce (G SP) mech anism is th e mo st wid ely-used au ction format in sponsored search markets . However , figuring ou t how to bi d on GSP auctions presents major theoretical and computational challenges due to the complex nature of the auction format and the infinite nu mber o f equ ilibria. Ou r stud y cha racterizes vario us eq uilibrium bidding behaviors in GSP auctions. We develop an algorithm t o identify all pure-strategy Nash equilibria and discuss their d istribution in th e pure-strategy sp ace. Th is eq uilibrium d istribution can h elp advertisers formulate bidding strategies, and help search engines calculate their expected revenues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pure-Strategy Nash Equilibria of GSP Keyword Auction

Research Article Linjing Li State Key Laboratory of Management and Control for Complex Systems, China [email protected] Daniel Zeng State Key Laboratory of Management and Control for Complex Systems, China [email protected] Huimin Zhao University of Wisconsin-Milwaukee [email protected] Despite the tremendous commercial success of generalized second-price (GSP) keyword auctions, it still remain...

متن کامل

Simulation-Based Game Theoretic Analysis of Keyword Auctions with Low-Dimensional Bidding Strategies

We perform a simulation-based analysis of keyword auctions modeled as one-shot games of incomplete information to study a series of mechanism design questions. Our first question addresses the degree to which incentive compatibility fails in generalized second-price (GSP) auctions. Our results suggest that sincere bidding in GSP auctions is a strikingly poor strategy and, typically, just as poo...

متن کامل

Generalized Second Price Auction with Probabilistic Broad Match1

Generalized Second Price (GSP) auctions are widely used by search engines today to sell their ad slots. Most search engines have supported the broad match between queries and bid keywords when executing the GSP auctions, however, it has been revealed that the GSP auction with the standard broad-match mechanism they are currently using (denoted as SBM-GSP) has several theoretical drawbacks (e.g....

متن کامل

On Best-Response Bidding in GSP Auctions

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and robustness properties of various strategies. In particular, we consider best-response bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid...

متن کامل

Keyword Auctions with Budget-constrained Bidders

We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman, Ostrovsky, and Schwarz (2007) and Varian (2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price (GSP) auctions. However, bidders often have to set their daily budgets when they participate in an auction; on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009